Nuprl Lemma : ws-lower-bound 11,40

p:FinProbSpace, F:(Outcome), q:. (x:Outcome. q  F(x))  q  weighted-sum(p;F
latex


Definitionst  T, x:AB(x), x:AB(x), b, , ||as||, #$n, {i..j}, r  s, P  Q, False, A, P & Q, A  B, i  j < k, , {x:AB(x)} , (x  l), Void, x:A.B(x), Top, a < b, type List, S  T, null(as), Type, xt(x), xLP(x), x:A  B(x), l[i], a  j < bE(j), s = t, f(a), , Outcome, FinProbSpace, x.A(x), True, T, SqStable(P), x,y:A//B(x;y), a  b, suptype(ST), weighted-sum(p;F), <ab>
Lemmasws-constant, squash wf, true wf, weighted-sum wf2, p-outcome wf, sq stable from decidable, decidable qle, qsum wf, select wf, l all wf2, qle wf, int inc rationals, not wf, assert wf, null wf3, top wf, ws-monotone, l member wf, int seg wf, length wf1, rationals wf

origin